Deterministic automaton

Results: 176



#Item
141Models of computation / Computer science / Applied mathematics / Deterministic finite automaton / Regular language / Regular expression / Finite-state machine / String operations / Automata theory / Formal languages / Theoretical computer science

regex2dot A regex to automaton compiler Diogo Sousa Universiteit Utrecht

Add to Reading List

Source URL: orium.pw

Language: English - Date: 2012-01-24 13:16:41
142Models of computation / Computer science / Applied mathematics / Deterministic pushdown automaton / Regular language / Regular expression / Context-free language / Automata theory / Formal languages / Theoretical computer science

Deterministic Pushdown Automata 237 Deterministic PDA (DPDA) A PDA P = (Q, Σ, Γ, δ, q0 , Z0 , F ) is deterministic if and only if

Add to Reading List

Source URL: www.cs.uiuc.edu

Language: English - Date: 2005-10-18 14:54:39
143Models of computation / Theoretical computer science / Model theory / Combinatorics on words / Logic / Structure / Finite-state machine / Deterministic finite automaton / Interpretation / Automata theory / Formal languages / Mathematics

Symbolic Automata for Static Specification Mining Hila Peleg1 , Sharon Shoham2 , Eran Yahav3 , and Hongseok Yang4 1 Tel Aviv University, Israel

Add to Reading List

Source URL: www.cs.technion.ac.il

Language: English - Date: 2013-05-17 17:02:48
144Computer science / Deterministic finite automaton / Nondeterministic finite automaton / Model theory / Regular language / Structure / First-order logic / Powerset construction / Linear temporal logic / Automata theory / Theoretical computer science / Logic

Logic, Automata, Games, and Algorithms Moshe Y. Vardi Rice University

Add to Reading List

Source URL: www.cs.rice.edu

Language: English - Date: 2013-06-11 21:41:58
145Theory of computation / Models of computation / Computer science / Context-free language / Recursively enumerable language / Finite-state machine / Regular language / Deterministic finite automaton / Nondeterministic finite automaton / Formal languages / Theoretical computer science / Automata theory

CS345: Theory of Computation Class schedule & room: Time:

Add to Reading List

Source URL: www.haverford.edu

Language: English - Date: 2012-04-10 18:04:10
146Computer science / Mathematics / Conjunctive query / Nondeterministic finite automaton / Deterministic finite automaton / Structure / Algorithm / Computational complexity theory / Finite-state machine / Automata theory / Models of computation / Theoretical computer science

Conjunctive Queries for EL with Role Composition Markus Krötzsch and Sebastian Rudolph Institute AIFB, Universität Karlsruhe, Germany {mak|sru}@aifb.uni-karlsruhe.de Abstract. EL++ is a rather expressive description l

Add to Reading List

Source URL: www.ceur-ws.org

Language: English - Date: 2007-05-22 01:39:22
147Applied mathematics / Computer science / Deterministic pushdown automaton / Pushdown automaton / Bisimulation / Graph / Nested word / Automata theory / Models of computation / Theoretical computer science

1 Book Title Book Editors IOS Press, 2003

Add to Reading List

Source URL: homepages.inf.ed.ac.uk

Language: English - Date: 2009-05-20 09:50:25
148Symbol / Pushdown automaton / Constructible universe / Ordinal number / Automata theory / Models of computation / Deterministic pushdown automaton

Deciding DPDA Equivalence is Primitive Recursive Colin Stirling

Add to Reading List

Source URL: homepages.inf.ed.ac.uk

Language: English - Date: 2009-05-20 09:52:43
149Applied mathematics / Mathematics / Deterministic pushdown automaton / Pushdown automaton / Bisimulation / Graph / Models of computation / Automata theory / Theoretical computer science

Language Theory and In nite Graphs Colin Stirling S hool of Informati s

Add to Reading List

Source URL: homepages.inf.ed.ac.uk

Language: English - Date: 2009-05-20 09:50:17
150Applied mathematics / Computer science / Deterministic pushdown automaton / Bisimulation / Computability / Context-free language / Finite-state machine / Automata theory / Models of computation / Theoretical computer science

Decidability of Bisimulation Equivalence for Pushdown Processes Colin Stirling Division of Informatics University of Edinburgh Edinburgh EH9 3JZ, UK

Add to Reading List

Source URL: homepages.inf.ed.ac.uk

Language: English - Date: 2009-05-20 09:59:44
UPDATE